Kolmogorov complexity and the asymptotic bound for error-correcting codes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kolmogorov complexity and the asymptotic bound for error-correcting codes

The set of all error-correcting block codes over a fixed alphabet with q letters determines a recursively enumerable set of rational points in the unit square with coordinates (R, δ):= (relative transmission rate, relative minimal distance). Limit points of this set form a closed subset, defined by R ≤ αq(δ), where αq(δ) is a continuous decreasing function called the asymptotic bound. Its exist...

متن کامل

On the Hamming bound for nonbinary localized-error-correcting codes

For nonbinary codes it is proved that the Hamming bound is asymptotically sharp in some range of the code rate.

متن کامل

A computability challenge: asymptotic bounds and isolated error-correcting codes

Consider the set of all error–correcting block codes over a fixed alphabet with q letters. It determines a recursively enumerable set of points in the unit square with coordinates (R, δ):= (relative transmission rate, relative minimal distance). Limit points of this set form a closed subset, defined by R ≤ αq(δ), where αq(δ) is a continuous decreasing function called asymptotic bound. Its exist...

متن کامل

Kolmogorov Complexity with Error

We introduce the study of Kolmogorov complexity with error. For a metric d, we define Ca(x) to be the length of a shortest program p which prints a string y such that d(x, y) ≤ a. We also study a conditional version of this measure Ca,b(x|y) where the task is, given a string y′ such that d(y, y′) ≤ b, print a string x′ such that d(x, x′) ≤ a. This definition admits both a uniform measure, where...

متن کامل

Synchronizable Error-Correcting Codes

A new technique for correcting synchronization errors in the transmission of discrete-symbol information is developed. The technique can be applied to any t-additive-error-correcting Bose-Chaudhuri-Hocquenghem code, to provide protection against synchronization errors. The synchronization error is corrected at the first complete received word after the word containing the synchronization error,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Differential Geometry

سال: 2014

ISSN: 0022-040X

DOI: 10.4310/jdg/1404912104